Using tree-fold and the data definition in the lesson, write the following functions:
;; number-of-nodes : Tree -> Number ;; RETURNS: the number of nodes in the given tree. ;; increment-all : Tree -> Tree ;; RETURNS: a tree just like the original, but in which all of the ;; leaves have contents one more than that in the original.
Last modified: Mon Sep 26 14:28:32 Eastern Daylight Time 2016